Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Jean-Fran¸cois Biasse∗ Abstract This paper gives polynomial time quantum algorithms for

Source URL: fangsong.info

DRAFTProject Number: EMCProject Name: Class II-L Effectiveness Monitoring BACKGROUND INFORMATION AND PROBLEM STATEMENT Conflicts in implementing the original Class II-L rules led to passage of the Cal

Source URL: www.bof.fire.ca.gov

WEBER’S CLASS NUMBER PROBLEM TAKASHI FUKUDA AND KEIICHI KOMATSU 1. Introduction Two hundred years ago, Gauss gave the following two conjectures (cf. [2]): Conjecture 1. The imaginary quadratic fields with class number

Source URL: staff.miyakyo-u.ac.jp

CONSTRUCTION OF MAXIMAL UNRAMIFIED p-EXTENSIONS WITH PRESCRIBED GALOIS GROUPS MANABU OZAKI (KINKI UNIVERSITY) 1. Introduction For any number field F (not necessary of finite degree) and prime

Source URL: staff.miyakyo-u.ac.jp

• Algebra
• Abstract algebra
• Ring theory
• Class field theory
• Field theory
• Algebraic number theory
• Galois theory
• Group theory
• Algebraic number field
• Embedding problem
• Field
• P-group

Numerical treatment of a class of optimal control problems arising in economics Etienne Emmrich† and Horst Schmitt‡ Version April 11, 2005 Abstract The approximate solution of the problem of controlling an initial va

Source URL: www.math.tu-berlin.de

• Mathematical analysis
• Mathematics
• Distribution
• Functional analysis
• Vehicle identification number
• Analysis

Syllabus 1. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible by

Source URL: www.artofproblemsolving.com

Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod

Source URL: www.siam.org

• Eulerian path
• NP-complete problems
• BEST theorem
• Degree
• Connectivity
• Hamiltonian path
• Tree
• Graph
• Route inspection problem
• Graph theory
• Mathematics
• Theoretical computer science

Bases Tanya Khovanova November 4, 2013 Class Discussion A static strategy for the Nine-coins problem, ternary numbers. Divisibility in bases: divisibility by n/2, by n − 1, by n + 1. Sum and multiply numbers

Source URL: www.tanyakhovanova.com

• Elementary number theory
• Group theory
• 3
• SOCKS
• 11
• Hexadecimal
• 2
• Divisor
• Mathematics
• Numbers
• Division

Invariants 2 Tanya Khovanova April 26, 2010 Class Discussion The variation of 12 coins problem when you need to produce the weighings in

Source URL: www.tanyakhovanova.com

• Elementary arithmetic
• Elementary number theory
• Number theory
• Square number
• 1000
• Pi
• Number
• Singly and doubly even
• Mathematics
• Numbers
• Integer sequences

The class number one problem for some non-abelian normal CM-fields of degree 24 Franz Lemmermeyer Bilkent University, Dept. Mathematics[removed]Bilkent, Ankara, Turkey

Source URL: www.fen.bilkent.edu.tr

• Algebraic number theory
• Galois group
• Algebraic number field
• Conductor
• Finite field
• Cubic field
• Field
• Kummer theory
• Ramification group
• Abstract algebra
• Algebra
• Field theory